The Weizmann Institute of Science Faculty of Mathematics And
نویسنده
چکیده
Bloom filters and Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error. Unlike Bloom filters, CBFs also support element deletions. In the first part of the talk, I will introduce a new general method based on variable increments to improve the efficiency of CBFs and their variants. I will demonstrate that this method can always achieve a lower false positive rate and a lower overflow probability bound than CBFs in practical systems.
منابع مشابه
Loop-Erased Random Walk and Poisson Kernel on Planar Graphs
Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on Z2 is SLE2. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into C so that edges do not cross one another). We show that if the scaling limit of the random walk is planar Brownian motion, then the scaling limit of its loop-erasure is SLE2. Our main co...
متن کاملContagious Sets in Random Graphs
We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least 2 active neighbors. A contagious set is a set whose activation results with the entire graph being active. Given a graph G, let m(G, 2) be the minimal size of a contagious set. We consider the binomial random grap...
متن کاملComputing the fault tolerance of multi-agent deployment
a Faculty of Electrical Engineering, Mathematics, and Computer Science, Delft University of Technology, 2628 CD Delft, The Netherlands b Department of Computer Science, Bar-Ilan University, Ramat Gan, 52900 Israel c Department of Computer Science & UMIACS, University of Maryland, College Park, MD 20742, USA d Department of Computer Science and Applied Mathematics, Weizmann Institute of Science,...
متن کاملImproved Approximation for Min-Sum Vertex Cover
The paper describes an approximation algorithm for the Min Sum Vertex Cover (MSVC) problem, achieving a constant approximation factor strictly smaller than 2, thus improving on the best currently known approximation algorithm for the problem. ∗Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel. E-mail: [email protected]. †Depar...
متن کاملComparative evaluation of notions of modularity in human motor control and of existing algorithms for the identification of motor primitives
1Section for Computational Sensomotorics, Department of Cognitive Neurology, Centre for Integrative Neuroscience, University Clinic Tübingen, Tübingen, Germany. 2Department of Neuromotor Physiology, Santa Lucia Foundation, Rome, Italy. 3Neurocognition and Action Research Group, Faculty of Psychology and Sport Science, University of Bielefeld, Bielefeld, Germany. 4Department of Computer Science ...
متن کاملGeneral minimal flavor violation
Alexander L. Kagan, Gilad Perez, Tomer Volansky, and Jure Zupan Department of Physics, University of Cincinnati, Cincinnati, Ohio 45221, USA Department of Particle Physics, Weizmann Institute of Science, Rehovot 76100, Israel YITP, Stony Brook University, Stony Brook, New York 11794-3840, USA School of Natural Sciences, Institute for Advanced Study, Princeton, New Jersey 08540, USA Theory Divis...
متن کامل